ON THE CAPABILITY OF FINITELY GENERATED NON-TORSION GROUPS OF NILPOTENCY CLASS 2
نویسندگان
چکیده
منابع مشابه
On rational groups with Sylow 2-subgroups of nilpotency class at most 2
A finite group $G$ is called rational if all its irreducible complex characters are rational valued. In this paper we discuss about rational groups with Sylow 2-subgroups of nilpotency class at most 2 by imposing the solvability and nonsolvability assumption on $G$ and also via nilpotency and nonnilpotency assumption of $G$.
متن کاملnth-roots and n-centrality of finite 2-generator p-groups of nilpotency class 2
Here we consider all finite non-abelian 2-generator $p$-groups ($p$ an odd prime) of nilpotency class two and study the probability of having $n^{th}$-roots of them. Also we find integers $n$ for which, these groups are $n$-central.
متن کاملOn the nilpotency class of the automorphism group of some finite p-groups
Let $G$ be a $p$-group of order $p^n$ and $Phi$=$Phi(G)$ be the Frattini subgroup of $G$. It is shown that the nilpotency class of $Autf(G)$, the group of all automorphisms of $G$ centralizing $G/ Fr(G)$, takes the maximum value $n-2$ if and only if $G$ is of maximal class. We also determine the nilpotency class of $Autf(G)$ when $G$ is a finite abelian $p$-group.
متن کاملOn the Conjugacy Separability in the Class of Finite P -groups of Finitely Generated Nilpotent Groups
It is proved that for any prime p a finitely generated nilpotent group is conjugacy separable in the class of finite p-groups if and only if the tor-sion subgroup of it is a finite p-group and the quotient group by the torsion subgroup is abelian. 1. Let K be a class of groups. A group G is called residual K (or K-residual) if for each non-unit element a ∈ G there is a homomorphism ϕ of G onto ...
متن کاملOn the Dimension of Matrix Representations of Finitely Generated Torsion Free Nilpotent Groups
It is well known that any polycyclic group, and hence any finitely generated nilpotent group, can be embedded into GLn(Z) for an appropriate n ∈ N; that is, each element in the group has a unique matrix representation. An algorithm to determine this embedding was presented in [6]. In this paper, we determine the complexity of the crux of the algorithm and the dimension of the matrices produced ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Glasgow Mathematical Journal
سال: 2011
ISSN: 0017-0895,1469-509X
DOI: 10.1017/s001708951100019x